On solving univariate sparse polynomials in logarithmic time
نویسندگان
چکیده
منابع مشابه
On solving univariate sparse polynomials in logarithmic time
Let f be a degree D univariate polynomial with real coefficients and exactly m monomial terms. We show that in the special case m 1⁄4 3 we can approximate within e all the roots of f in the interval 1⁄20;R using just OðlogðDÞlogðD log Re ÞÞ arithmetic operations. In particular, we can count the number of roots in any bounded interval using just Oðlog DÞ arithmetic operations. Our speed-ups are ...
متن کاملSparse univariate polynomials with many roots over finite fields
Suppose q is a prime power and f ∈ Fq[x] is a univariate polynomial with exactly t nonzero terms and degree <q−1. To establish a finite field analogue of Descartes’ Rule, Bi, Cheng and Rojas (2013) proved an upper bound of 2(q − 1) t−2 t−1 on the number of cosets in F∗ q needed to cover the roots of f in F∗ q . Here, we give explicit f with root structure approaching this bound: For q a t power...
متن کاملDeterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials
We present the first efficient deterministic algorithm for factoring sparse polynomials that split into multilinear factors and sums of univariate polynomials. Our result makes partial progress towards the resolution of the classical question posed by von zur Gathen and Kaltofen in [6] to devise an efficient deterministic algorithm for factoring (general) sparse polynomials. We achieve our goal...
متن کاملOn the S-Lemma for Univariate Polynomials
The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization, and non-convex quadratic optimization. Hitherto, S-lemma is however established only in the domain of quadratic functions. In this paper we shall extend the notion of S-lemma to the class of univariat...
متن کاملSparse Rational Univariate Representation
We present explicit worst case degree and height bounds for the rational univariate representation of the isolated roots of polynomial systems based on mixed volume. We base our estimations on height bounds of resultants and we consider the case of 0-dimensional, positive dimensional, and parametric polynomial systems. CCS Concepts •Computing methodologies→ Symbolic calculus algorithms;
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2005
ISSN: 0885-064X
DOI: 10.1016/j.jco.2004.03.004